package problem674;

//674.最长连续递增序列
//https://leetcode.cn/problems/longest-continuous-increasing-subsequence/

class Solution {
    public int findLengthOfLCIS(int[] nums) {
        int ret = 1;
        int len = 1;
        for(int i = 1; i < nums.length; i++) {
            if(nums[i] > nums[i-1]) len++;
            else len = 1;
            ret = Math.max(ret, len);
        }
        return ret;
    }
}